from math import *

def isPrime(n) -> bool:
    if not isinstance(n, int):
        return False
    for i in range(2, int(sqrt(n))+1):
        if (n % i) == 0:
            return False
    return True

print(isPrime(2))
print(isPrime(3))
print(isPrime(4))
print(isPrime(5))
print(isPrime(6))
print(isPrime(7))
print(isPrime(8))
print(isPrime(34511))